Using resultants for SAGBI basis verification in the univariate polynomial ring
نویسندگان
چکیده
منابع مشابه
Implicitization using univariate resultants
Among several implicitization methods, the method based on resultant computation is a simple and direct one, but it often brings extraneous factors which are difficult to remove. This paper studies a class of rational space curves and rational surfaces by implicitization with univariate resultant computations. This method is more efficient than the other algorithms in finding implicit equations...
متن کاملA Sagbi Basis For
Let Cp denote the cyclic group of order p where p ≥ 3 is prime. We denote by Vn the indecomposable n dimensional representation of Cp over a field F of characteristic p. We compute a set of generators, in fact a SAGBI basis, for the ring of invariants F[V2 ⊕ V2 ⊕ V3]p .
متن کاملA Sagbi Basis for the Quantum Grassmannian
The maximal minors of a p× (m+p)-matrix of univariate polynomials of degree n with indeterminate coefficients are themselves polynomials of degree np. The subalgebra generated by their coefficients is the coordinate ring of the quantum Grassmannian, a singular compactification of the space of rational curves of degree np in the Grassmannian of p-planes in (m + p)-space. These subalgebra generat...
متن کاملPolynomial Resultants
This paper covers various aspects of the resultant of polynomials. Starting with a definition, we move to a practical method of calculating the resultant, specifically through the use of the Sylvester matrix, whose entries are the coefficients of the two polynomials, and whose determinant gives the resultant of two polynomials. We focus on whether or not two univariate polynomials have a common...
متن کاملResultants for Unmixed Bivariate Polynomial Systems using the Dixon formulation
A necessary and sufficient condition on the support of a generic unmixed bivariate polynomial system is identified such that for polynomial systems with such support, the Dixon resultant formulation produces their resultants. It is shown that Sylvester-type matrices can also be obtained for such polynomial systems. These results are shown to be a generalization of related results recently repor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2005
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2004.06.002